Container-Based Job Management for Fair Resource Sharing

نویسندگان

  • Jue Hong
  • Pavan Balaji
  • Gaojin Wen
  • Bibo Tu
  • Junming Yan
  • Cheng-Zhong Xu
  • Shengzhong Feng
چکیده

Achieving fair resource sharing is rapidly becoming an essential requirement in cluster computing systems. Although many fair scheduling algorithms have been proposed in recent decades, controlling resource sharing among jobs on servers remains a challenging problem that, if not handled well, may result in chaotic resource contention and service-level agreement violation of jobs. To address this problem, we propose a resource container–based job management approach for fair resource sharing. In our approach, we first design and implement a general container-based job management module, providing lightweight and fine-grained resource allocation and isolation for job execution. With this module, we propose a resource-aware management scheme to enable fair resource sharing in job scheduling and dispatching. We conduct experiments by implementing the proposed module and applying the scheme on TCluster, a self-developed cluster computing system of a worldwide top Internet corporation. Results show that our approach performs well in guaranteeing fair resource sharing with negligible overhead.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Fair Resource-Sharing in Large Peer-to-Peer Systems

Accountability is becoming a major concern for the Internet. Wide spread of misconduct by profit driven hackers makes trust (faith)-based applications vulnerable to malicious attacks. An evidence based resource management system can guarantee that collaborative parties will share their resources based un-deniable evidence, so that community members cannot abuse their privileges without being ca...

متن کامل

Practical Size-based Scheduling for MapReduce Workloads

We present the Hadoop Fair Sojourn Protocol (HFSP) scheduler, which implements a size-based scheduling discipline for Hadoop. The benefits of size-based scheduling disciplines are well recognized in a variety of contexts (computer networks, operating systems, etc...), yet, their practical implementation for a system such as Hadoop raises a number of important challenges. With HFSP, which is ava...

متن کامل

Dynamic Load Balancing with Tokens

Efficiently exploiting the resources of data centers is a complex task that requires efficient and reliable load balancing and resource allocation algorithms. The former are in charge of assigning jobs to servers upon their arrival in the system, while the latter are responsible for sharing server resources between their assigned jobs. These algorithms should take account of various constraints...

متن کامل

HFSP: The Hadoop Fair Sojourn Protocol

This work presents the HFSP scheduler, which implements a size-based scheduling discipline for Hadoop. While the benefits of size-based scheduling disciplines are well recognized in a variety of contexts (computer networks, operating systems, etc...), their practical implementation for a system such as Hadoop raises a number of important challenges. In HFSP we address issues related to job size...

متن کامل

Knowledge-Based Scheduling Resource into Grid System by Second-Price Auctions with Best Response Dynamics

In recent years, grid computing systems have become popular for the resolution of large-scale complex problems in science, engineering and industry. In order that grid computing focus on scalability of high system and also on large-scale resource sharing, an effcient resource management system is crucial for the efficacy of the system. However, providing effective scheduling and resource alloca...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013